Design of Degree-Computationless Modified Euclidean Algorithm using Polynomial Expression
نویسندگان
چکیده
منابع مشابه
Euclidean Algorithm for Laurent Polynomial Matrix Extension
In this paper, we develop a novel and effective Euclidean algorithm for Laurent polynomial matrix extension (LPME), which is the key of the construction of perfect reconstruction filter banks (PRFBs). The algorithm simplifies the dual-chain approach to the construction of PRFBs in the paper [5]. The algorithm in this paper can also be used in the applications where LPME plays a role.
متن کاملContinuous Path-smoothing Algorithm Using Modified Quadratic Polynomial Interpolation
Path searching algorithm is one of the main topics in studies on path planning. These algorithms are used to avoiding obstacles and find paths from starting point to target point. There are dynamic problems that must be addressed when these paths are applied in real environments. In order to be applicable in actual situations, the path must be a smooth path. A smooth path is a path that maintai...
متن کاملFuzzy Classifier Design using Modified Genetic Algorithm
Development of fuzzy ifthen rules and formation of membership functions are the important consideration in designing a fuzzy classifier system. This paper presents a Modified Genetic Algorithm (ModGA) approach to obtain the optimal rule set and the membership function for a fuzzy classifier. In the genetic population, the membership functions are represented using real numbers and the rule set ...
متن کاملDesign of IIR Digital Filter using Modified Chaotic Orthogonal Imperialist Competitive Algorithm (RESEARCH NOTE)
There are two types of digital filters including Infinite Impulse Response (IIR) and Finite Impulse Response (FIR). IIR filters attract more attention as they can decrease the filter order significantly compared to FIR filters. Owing to multi-modal error surface, simple powerful optimization techniques should be utilized in designing IIR digital filters to avoid local minimum. Imperialist compe...
متن کاملA Deterministic and Polynomial Modified Perceptron Algorithm
We construct a modi ed perceptron algorithm that is deterministic, polynomial and also as fast as previous known algorithms. The algorithm runs in time O(mn log n log(1/ρ)), where m is the number of examples, n the number of dimensions and ρ is approximately the size of the margin. We also construct a non-deterministic modi ed perceptron algorithm running in time O(mn log n log(1/ρ)). 1 A Deter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Korea Information and Communications Society
سال: 2011
ISSN: 1226-4717
DOI: 10.7840/kics.2011.36a.10.809